A model for rational abandonments from invisible queues
نویسندگان
چکیده
We propose a model for abandonments from a queue, due to excessive wait, assuming that waiting customers act rationally but without being able to observe the queue length. Customers are allowed to be heterogeneous in their preferences and consequent behavior. Our goal is to characterize customers’ patience via more basic primitives, specifically waiting costs and service benefits: these two are optimally balanced by waiting customers, based on their individual cost parameters and anticipated waiting time. The waiting time distribution and patience profile then emerge as an equilibrium point of the system. The problem formulation is motivated by teleservices, prevalently telephoneand Internet-based. In such services, customers and servers are remote and queues are typically associated with the servers, hence queues are invisible to waiting customers. Our base model is the M/M/m queue, where it is shown that a unique equilibrium exists, in which rational abandonments can occur only upon arrival (zero or infinite patience for each customer). As such a behavior fails to capture the essence of abandonments, the base model is modified to account for unusual congestion or failure conditions. This indeed facilitates abandonments in finite time, leading to a nontrivial, customer dependent patience profile. Our analysis shows, quite surprisingly, that the equilibrium is unique in this case as well, and amenable to explicit calculation.
منابع مشابه
Queueing Systems with
Queueing Systems with Customer Abandonments and Retrials by Song Deng Doctor of Philosophy in Engineering Industrial Engineering & Operations Research University of California, Berkeley Assistant Professor Ying-Ju Chen , Co-chair Professor Zuo-Jun “Max” Shen , Co-chair In queueing theory, the phenomenon that customers get impatient and renege from the system when the waiting time exceeds their ...
متن کاملA Markov model for measuring service levels in nonstationary G(t)/G(t)/s(t) +G(t) queues
We present a Markov model to approximate the queueing behavior at the G(t)/G(t)/s(t) + G(t) queue with exhaustive discipline and abandonments. The performance measures of interest are: (1) the average number of customers in queue, (2) the variance of the number of customers in queue, (3) the average number of abandonments and (4) the virtual waiting time distribution of a customer when arriving...
متن کاملQueues with Many Servers and Impatient Customers
The asymptotic many-server queue with abandonments, G/GI/N +GI , is considered in the qualityand efficiency-driven (QED) regime. Here the number of servers and the offered load are related via the square-root rule, as the number of servers increases indefinitely. QED performance entails short waiting times and scarce abandonments (high quality) jointly with high servers’ utilization (high effic...
متن کاملEfficiency-Driven Heavy-Traffic Approximations for Many-Server Queues with Abandonments
T provide useful practical insight into the performance of service-oriented (non-revenue-generating) call centers, which often provide low-to-moderate quality of service, this paper investigates the efficiency-driven (ED), many-server heavy-traffic limiting regime for queues with abandonments. Attention is focused on the M/M/s/r +M model, having a Poisson arrival process, exponential service ti...
متن کاملTwo fluid approximations for multi-server queues with abandonments
Insight is provided into a previously developed M/M/s/r + M(n) approximation for the M/GI/s/r + GI queueing model by establishing fluid and diffusion limits for the approximating model. Fluid approximations for the two models are compared in the many-server efficiency-driven (overloaded) regime. The two fluid approximations do not coincide, but they are close. Short title: Fluid Approximations
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Queueing Syst.
دوره 36 شماره
صفحات -
تاریخ انتشار 2000